An Improved Ant Colony Optimization for VRP with Time Windows
نویسندگان
چکیده
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملAn Improved Ant Colony Algorithm to Solve Vehicle Routing Problem with Time Windows
This paper presents an improved ant colony optimization algorithm (ACO algorithm) based on Ito differential equations, the proposed algorithm integrates the versatility of Ito thought with the accuracy of ACO algorithm in solving the vehicle routing problem (VRP), and it executes simultaneous move and wave process, and employs exercise ability to unify move and wave intensity. Move and wave ope...
متن کاملAn Interactive Distributed Approach for the Vrp with Time Windows
The Vehicle Routing Problem with Time Windows (VRPTW) is a hard combinatorial problem that has received a lot of attention in Operations Research and Artificial Intelligence literature. This interest is due, on one hand to, its wide applicability in real-world cases and practical settings, and on the other hand to its NP-hard aspect. Several models and solving methods, essentially centralised, ...
متن کاملAn improved ant colony optimization for vehicle routing problem
The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an improved ant colony optimization (IACO), which possesses a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve VRP. The computational results for fourteen benchmark problems are report...
متن کاملAn Improved Ant Colony Optimization Algorithm for Solving TSP
The basic ant colony optimization (ACO) algorithm takes on a longer computing time in the search process and is prone to fall into local optimal solutions, an improved ACO (CEULACO) algorithm is proposed in this paper. In the CEULAC algorithm, the direction guidance and real variable function are used to initialize pheromone concentration according to the path information of undirected graph. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Signal Processing, Image Processing and Pattern Recognition
سال: 2016
ISSN: 2005-4254,2005-4254
DOI: 10.14257/ijsip.2016.9.10.31